Counting Solutions to Random CNF Formulas
نویسندگان
چکیده
Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 13 July 2020Accepted: 11 August 2021Published online: 29 November 2021Keywordsrandom k-SAT, approximate counting, satisfiabilityAMS Subject Headings68W40, 68Q87Publication DataISSN (print): 0097-5397ISSN (online): 1095-7111Publisher: Society for Industrial and Applied MathematicsCODEN: smjcat
منابع مشابه
Model counting of monotone CNF formulas with Spectra
Model-counting is the #P problem of counting the number of satisfying solutions of a given propositional formula. Here we focus on a restricted variant of this problem, where the input formula is monotone (i.e., there are no negations). A monotone Conjunctive Normal Form (CNF) formula is sufficient for modeling various graph problems, e.g., the vertex covers of a graph. Even for this restricted...
متن کاملUnderstanding model counting for $β$-acyclic CNF-formulas
We extend the knowledge about so-called structural restrictions of #SAT by giving a polynomial time algorithm for β-acyclic #SAT. In contrast to previous algorithms in the area, our algorithm does not proceed by dynamic programming but works along an elimination order, solving a weighted version of constraint satisfaction. Moreover, we give evidence that this deviation from more standard algori...
متن کاملUnderstanding Model Counting for beta-acyclic CNF-formulas
We extend the knowledge about so-called structural restrictions of #SAT by giving a polynomial time algorithm for β-acyclic #SAT. In contrast to previous algorithms in the area, our algorithm does not proceed by dynamic programming but works along an elimination order, solving a weighted version of constraint satisfaction. Moreover, we give evidence that this deviation from more standard algori...
متن کاملAn Automata-Theoretic Algorithm for Counting Solutions to Presburger Formulas
We present an algorithm for counting the number of integer solutions to selected free variables of a Presburger formula. We represent the Presburger formula as a deterministic finite automaton (DFA) whose accepting paths encode the standard binary representations of satisfying free variable values. We count the number of accepting paths in such a DFA to obtain the number of solutions without en...
متن کاملLinear CNF formulas and satisfiability
In this paper, we study linear CNF formulas generalizing linear hypergraphs un-der combinatorial and complexity theoretical aspects w.r.t. SAT. We establish NP-completeness of SAT for the unrestricted linear formula class, and we show the equiv-alence of NP-completeness of restricted uniform linear formula classes w.r.t. SATand the existence of unsatisfiable uniform linear witne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2021
ISSN: ['1095-7111', '0097-5397']
DOI: https://doi.org/10.1137/20m1351527